Перевод: с английского на русский

с русского на английский

flows in graphs

См. также в других словарях:

  • Economic Affairs — ▪ 2006 Introduction In 2005 rising U.S. deficits, tight monetary policies, and higher oil prices triggered by hurricane damage in the Gulf of Mexico were moderating influences on the world economy and on U.S. stock markets, but some other… …   Universalium

  • Nowhere-zero flow — In graph theory, nowhere zero flows are a special type of network flow which is related (by duality) to coloring planar graphs. Let G = (V,E) be a directed graph and let M be an abelian group. We say that a map is a flow or an M flow if the… …   Wikipedia

  • river — river1 riverless, adj. riverlike, adj. /riv euhr/, n. 1. a natural stream of water of fairly large size flowing in a definite course or channel or series of diverging and converging channels. 2. a similar stream of something other than water: a… …   Universalium

  • Larrys Creek — Geobox | River name = Larrys Creek category = Creek image size = 300 image caption = Larrys Creek and the Cogan House Covered Bridge in Cogan House Township, Pennsylvania etymology = Larry Burt, first settler country = United States country state …   Wikipedia

  • Plot (graphics) — Scatterplot of the eruption interval for Old Faithful (a geyser). A plot is a graphical technique for representing a data set, usually as a graph showing the relationship between two or more variables. The plot can be drawn by hand or by a… …   Wikipedia

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve …   Wikipedia

  • Navier–Stokes equations — Continuum mechanics …   Wikipedia

  • Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… …   Wikipedia

  • White Deer Hole Creek — Geobox River name = White Deer Hole Creek native name = other name = other name1 = image size = 300 image caption = White Deer Hole Creek near the Fourth Gap of South White Deer Ridge etymology = Lenape language Woap achtu woalhen country =… …   Wikipedia

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»